Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking
نویسندگان
چکیده
Here we prove Lemma 3 from the paper Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking submitted to SBMF 2015. According to our parameterisation rules defined in [1], the application of parameterisation (and parameter instantiation) only affects the values of transitions an labellings but not the state space. Thus, M (Bn) and M (Bn)(Bm) in Lemma 3 are both defined over the identical set of states S . Moreover, if π is a sequence of states in M (Bn) then π is also a sequence of states in M (Bn)(Bm) and vice versa. This fact together with Definition 5 (Completion) gives us the following proposition:
منابع مشابه
Parameterisation of Three-Valued Abstractions
T hree-valued abstraction is an established technique in software m odelchecking. It proceeds by generating a state space m odelover the values true, false and unknown, where the latter value is used to represent the loss of inform ation due to abstraction. T em porallogic properties can then be evaluated on such m odels. In case of an unknown result, the abstraction is iteratively refined. In ...
متن کاملOn Symmetries and Spotlights - Verifying Parameterised Systems
Parameterised model checking is concerned with verifying properties of arbitrary numbers of homogeneous processes composed in parallel. The problem is known to be undecidable in general. Nevertheless, a number of approaches have developed verification techniques for certain classes of parameterised systems. Here, we present an approach combining symmetry arguments with spotlight abstractions. T...
متن کاملVerification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Verification problems for finiteand infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES then solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a pragmatic methodology for solving PBESs, viz., by attempting t...
متن کاملParallel SAT-Based Parameterised Three-Valued Model Checking
Parameterisation in three-valued model checking (PMC) allows to establish logical connections between unknown parts in state space models. The application of parameterisation enhances the precision of models without increasing their state space, but it leads to an exponential growth of the number of model checking instances that have to be checked consecutively. Here, we introduce a technique f...
متن کاملFormal Verification of Opinion Formation in Swarms
We investigate the formal verification of consensus protocols in swarm systems composed of arbitrary many agents. We use templates to define the behaviour of the agents in an opinion dynamics setting and formulate their verification in terms of the associated parameterised model checking problem. We define a finite abstract model that we show to simulate swarms of any size, thereby precisely en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015